IRKO: An Improved Runge-Kutta Optimization Algorithm for Global Optimization Problems

نویسندگان

چکیده

Optimization is a key technique for maximizing or minimizing functions and achieving optimal cost, gains, energy, mass, so on. In order to solve optimization problems, metaheuristic algorithms are essential. Most of these techniques influenced by collective knowledge natural foraging. There no such thing as the best worst algorithm; instead, there more effective certain problems. Therefore, in this paper, new improved variant recently proposed metaphorless Runge-Kutta (RKO) algorithm, called Improved (IRKO) suggested solving The IRKO formulated using basic RKO local escaping operator enhance diversification intensification capability version. performance algorithm validated on 23 standard benchmark three engineering constrained outcomes compared with seven state-of-the-art algorithms, including algorithm. Compared other recommended superior discovering results all selected runtime less than 0.5 s most problems stands first real-world

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improved Cuckoo Search Algorithm for Global Optimization

The cuckoo search algorithm is a recently developedmeta-heuristic optimization algorithm, which is suitable forsolving optimization problems. To enhance the accuracy andconvergence rate of this algorithm, an improved cuckoo searchalgorithm is proposed in this paper. Normally, the parametersof the cuckoo search are kept constant. This may lead todecreasing the efficiency of the algorithm. To cop...

متن کامل

improved cuckoo search algorithm for global optimization

the cuckoo search algorithm is a recently developedmeta-heuristic optimization algorithm, which is suitable forsolving optimization problems. to enhance the accuracy andconvergence rate of this algorithm, an improved cuckoo searchalgorithm is proposed in this paper. normally, the parametersof the cuckoo search are kept constant. this may lead todecreasing the efficiency of the algorithm. to cop...

متن کامل

Global Optimization for Algebraic Geometry - Computing Runge-Kutta Methods

This research work presents a new evolutionary optimization algorithm, EVO-RUNGE-KUTTA in theoretical mathematics with applications in scientific computing. We illustrate the application of EVO-RUNGE-KUTTA, a two-phase optimization algorithm, to a problem of pure algebra, the study of the parameterization of an algebraic variety, an open problem in algebra. Results show the design and optimizat...

متن کامل

Global optimization of explicit strong-stability-preserving Runge-Kutta methods

Strong-stability-preserving Runge-Kutta (SSPRK) methods are a type of time discretization method that are widely used, especially for the time evolution of hyperbolic partial differential equations (PDEs). Under a suitable stepsize restriction, these methods share a desirable nonlinear stability property with the underlying PDE; e.g., positivity or stability with respect to total variation. Thi...

متن کامل

An Improved Firefly Algorithm for Optimization Problems

Optimization problem is one of the most difficult and challenging problems that has received considerable attention over the last decade. Researchers have been constantly investigating better ways to solve it. Recently, one optimization technique called firefly algorithm has gained the interest of many researchers. This algorithm is a type of swarm intelligence algorithm based on the reaction o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers, materials & continua

سال: 2022

ISSN: ['1546-2218', '1546-2226']

DOI: https://doi.org/10.32604/cmc.2022.020847